Syndetic sets, paving and the Feichtinger conjecture
نویسندگان
چکیده
منابع مشابه
Frames and the Feichtinger Conjecture
We show that the conjectured generalization of the BourgainTzafriri restricted-invertibility theorem is equivalent to the conjecture of Feichtinger, stating that every bounded frame can be written as a finite union of Riesz basic sequences. We prove that any bounded frame can at least be written as a finite union of linear independent sequences. We further show that the two conjectures are impl...
متن کاملA bound for Feichtinger conjecture
In this paper, using the discrete Fourier transform in the finite-dimensional Hilbert space C^n, a class of nonRieszable equal norm tight frames is introduced and using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...
متن کاملThe Feichtinger Conjecture and Reproducing Kernel Hilbert Spaces
In this dissertation, we study the Feichtinger Conjecture(FC), which has been shown to be equivalent to the celebrated Kadison-Singer Problem. The FC states that every norm-bounded below Bessel sequence in a Hilbert space can be partitioned into finitely many Riesz basic sequences. This study is divided into two parts. In the first part, we explore the FC in the setting of reproducing kernel Hi...
متن کاملThe Paving Conjecture Is Equivalent to the Paving Conjecture for Triangular Matrices
We resolve a 25 year old problem by showing that The Paving Conjecture is equivalent to The Paving Conjecture for Triangular Matrices.
متن کاملA Decomposition Theorem for Frames and the Feichtinger Conjecture
In this paper we study the Feichtinger Conjecture in frame theory, which was recently shown to be equivalent to the 1959 Kadison-Singer Problem in C-Algebras. We will show that every bounded Bessel sequence can be decomposed into two subsets each of which is an arbitrarily small perturbation of a sequence with a finite orthogonal decomposition. This construction is then used to answer two open ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2011
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-2010-10600-7